Universal Coding of Ergodic Sources for Multiple Decoders with Side Information

نویسندگان

  • Shigeaki Kuzuoka
  • Akisato Kimura
  • Tomohiko Uyematsu
چکیده

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Scalable Source Coding for Multiple Decoders with Side Information

The problem of side-information scalable (SIscalable) source coding and the problem of successive refinement in the Wyner-Ziv (SR-WZ) setting are considered in this paper. Both problems can be understood as special cases of the general problem of scalable lossy source coding for multiple decoders with access to side informations, but the encoder does not. In the former problem, the quality of t...

متن کامل

A Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding

Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...

متن کامل

Universal Coding for Correlated Sources with Memory

|Universal coding problem for the system of Slepian and Wolf (the SW-system) has rst been investigated by Csisz ar and Korner. They considered the correlated memoryless sources, and established a universally attainable error exponent as a function of rate pair (R1;R2) that is positive whenever (R1; R2) is an inner point of the admissible rate region of the SW-system, which is speci ed dependin...

متن کامل

Universal noiseless coding

A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...

متن کامل

Distributed Source Coding for Satellite Communications

Inspired by mobile satellite communications systems, we consider a source coding system which consists of multiple sources, multiple encoders, and multiple decoders. Each encoder has access to a certain subset of the sources, each decoder has access to certain subset of the encoders, and each decoder reconstructs a certain subset of the sources almost perfectly. The connectivity between the sou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1004.3085  شماره 

صفحات  -

تاریخ انتشار 2010